Compiler controls for program regions

ABSTRACT

Setting or updating of floating point controls is managed. Floating point controls include controls used for floating point operations, such as rounding mode and/or other controls. Further, floating point controls include status associated with floating point operations, such as floating point exceptions and/or others. The management of the floating point controls includes efficiently updating the controls, while reducing costs associated therewith.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of co-pending U.S. patent applicationSer. No. 15/631,080, filed Jun. 23, 2017, entitled “COMPILER CONTROLSFOR PROGRAM REGIONS,” which is hereby incorporated herein by referencein its entirety.

BACKGROUND

One or more aspects relate, in general, to processing within a computingenvironment, and in particular, to facilitating such processing.

Processing within a computing environment includes performingoperations, and some of those operations employ arithmetic. There aredifferent types of arithmetic, including, for example, floating point,decimal floating point, binary, and hexadecimal arithmetic, to name afew. Each type of arithmetic uses a specific representation. Forinstance, floating point arithmetic uses a formulaic representation ofreal numbers as an approximation to support a trade-off between rangeand precision. Floating point arithmetic is used by floating pointoperations.

To manage floating point operations within a computing environment, afloating point control and/or status register is provided. As examples,a floating point control/status register includes floating pointcontrols, such as, for instance, mask bits, flag bits, data exceptioncode and rounding mode fields, to control floating point operationswithin a computing environment.

Currently, two approaches for managing the floating point controls areused, including updating the floating point control/status register,which requires serialization to be performed to stop processing in orderto update the controls; and a floating point control register renamingprocess which is expensive in implementation.

SUMMARY

Shortcomings of the prior art are overcome and additional advantages areprovided through the provision of a computer-implemented method offacilitating processing within a computing environment. The methodincludes, for instance, determining that a program region has a floatingpoint control associated therewith. The floating point control isindicated by at least one delimiter associated with the program region.The floating point control indicated by the at least one delimiter isused to update an active floating point mode. Code is generated for atleast one instruction in the program region based on the active floatingpoint mode.

Computer program products and systems relating to one or more aspectsare also described and claimed herein. Further, services relating to oneor more aspects are also described and may be claimed herein.

Additional features and advantages are realized through the techniquesdescribed herein. Other embodiments and aspects are described in detailherein and are considered a part of the claimed aspects.

BRIEF DESCRIPTION OF THE DRAWINGS

One or more aspects are particularly pointed out and distinctly claimedas examples in the claims at the conclusion of the specification. Theforegoing and objects, features, and advantages of one or more aspectsare apparent from the following detailed description taken inconjunction with the accompanying drawings in which:

FIG. 1A depicts one example of a computing environment to incorporateand use one or more aspects of the present invention;

FIG. 1B depicts further details of a processor of FIG. 1A, in accordancewith an aspect of the present invention;

FIG. 1C depicts yet further details of a processor of FIG. 1A, inaccordance with an aspect of the present invention;

FIG. 2A depicts one example of code used to change the rounding mode ofa floating point operation;

FIG. 2B depicts another example of code used to change the rounding modeof a floating point operation;

FIGS. 3A-C depict examples of a Read and Set Floating Point Status andControl instruction, in accordance with aspects of the presentinvention;

FIG. 4A depicts another example of setting the rounding mode of afloating point operation;

FIG. 4B depicts one example of setting the rounding mode of a floatingpoint operation, in accordance with an aspect of the present invention;

FIG. 5 depicts one embodiment of setting a selected control field of afloating point control register, in accordance with an aspect of thepresent invention;

FIG. 6 depicts another embodiment of setting a selected control field ofa floating point control register, in accordance with an aspect of thepresent invention;

FIG. 7 depicts another example of setting selected control fields of afloating point control register, in accordance with an aspect of thepresent invention;

FIGS. 8A-8B depict another example of setting selected control fields ofa floating point control register, in accordance with aspects of thepresent invention;

FIGS. 9A-9D depict examples of prefix instructions used in accordancewith one or more aspects of the present invention;

FIG. 10 depicts further details of using a prefix instruction, inaccordance with an aspect of the present invention;

FIG. 11 depicts further embodiments of updating a rounding mode controlfor different types of arithmetic, in accordance with an aspect of thepresent invention;

FIGS. 12A-12D depict other examples of prefix instructions, inaccordance with one or more aspects of the present invention;

FIG. 13 depicts further details of using an exception prefix indicator,in accordance with an aspect of the present invention;

FIG. 14 depicts further details of using a floating point controlassociated with a program region, in accordance with an aspect of thepresent invention;

FIG. 15 depicts one embodiment of updating an active floating pointmode, in accordance with an aspect of the present invention;

FIG. 16 depicts one technique of using user-specified floating pointcontrols with optimization, in accordance with an aspect of the presentinvention;

FIG. 17 depicts one embodiment of generating machine instructions withfloating point prefixes, in accordance with an aspect of the presentinvention;

FIG. 18 depicts one aspect of a compiler technique to perform processingassociated with floating point mode indicators, in accordance with anaspect of the present invention;

FIG. 19 depicts a further embodiment of a compiler technique to performprocessing associated with floating point mode indicators, in accordancewith an aspect of the present invention;

FIGS. 20A-20B depict one embodiment of facilitating processing in acomputing environment, in accordance with an aspect of the presentinvention;

FIG. 21A depicts another example of a computing environment toincorporate and use one or more aspects of the present invention;

FIG. 21B depicts further details of the memory of FIG. 21A;

FIG. 22 depicts one embodiment of a cloud computing environment; and

FIG. 23 depicts one example of abstraction model layers.

DETAILED DESCRIPTION

In accordance with one or more aspects, a capability is provided toenhance management of floating point controls. As used herein, floatingpoint controls include controls used for floating point operations, suchas rounding mode and/or other controls, and status associated withfloating point operations, such as a data exception code, floating pointexceptions, and/or others. Other controls and/or status may also beincluded in floating point controls. These floating point controls maybe located in a register, such as a floating point control register(also referred to as a floating point control and status register). Thiscapability includes reducing the serialization currently used to performan update of the floating point control register and to avoid renamingthe floating point control register.

One embodiment of a computing environment to incorporate and use one ormore aspects of the present invention is described with reference toFIG. 1A. In one example, the computing environment is based on thez/Architecture, offered by International Business Machines Corporation,Armonk, N.Y. One embodiment of the z/Architecture is described in“z/Architecture Principles of Operation,” IBM Publication No.SA22-7832-10, March 2015, which is hereby incorporated herein byreference in its entirety. Z/ARCHITECTURE is a registered trademark ofInternational Business Machines Corporation, Armonk, N.Y., USA.

In another example, the computing environment is based on the PowerArchitecture, offered by International Business Machines Corporation,Armonk, N.Y. One embodiment of the Power Architecture is described in“Power ISA™ Version 2.07B,” International Business Machines Corporation,Apr. 9, 2015, which is hereby incorporated herein by reference in itsentirety. POWER ARCHITECTURE is a registered trademark of InternationalBusiness Machines Corporation, Armonk, N.Y., USA.

The computing environment may also be based on other architectures,including, but not limited to, the Intel x86 architectures. Otherexamples also exist.

As shown in FIG. 1A, a computing environment 100 includes, for instance,a computer system 102 shown, e.g., in the form of a general-purposecomputing device. Computer system 102 may include, but is not limitedto, one or more processors or processing units 104 (e.g., centralprocessing units (CPUs)), a memory 106 (referred to as main memory orstorage, as examples), and one or more input/output (I/O) interfaces108, coupled to one another via one or more buses and/or otherconnections 110.

Bus 110 represents one or more of any of several types of busstructures, including a memory bus or memory controller, a peripheralbus, an accelerated graphics port, and a processor or local bus usingany of a variety of bus architectures. By way of example, and notlimitation, such architectures include the Industry StandardArchitecture (ISA), the Micro Channel Architecture (MCA), the EnhancedISA (EISA), the Video Electronics Standards Association (VESA) localbus, and the Peripheral Component Interconnect (PCI).

Memory 106 may include, for instance, a cache 120, such as a sharedcache, which may be coupled to local caches 122 of processors 104.Further, memory 106 may include one or more programs or applications130, an operating system 132, and one or more computer readable programinstructions 134. Computer readable program instructions 134 may beconfigured to carry out functions of embodiments of aspects of theinvention.

Computer system 102 may also communicate via, e.g., I/O interfaces 108with one or more external devices 140, one or more network interfaces142, and/or one or more data storage devices 144. Example externaldevices include a user terminal, a tape drive, a pointing device, adisplay, etc. Network interface 142 enables computer system 102 tocommunicate with one or more networks, such as a local area network(LAN), a general wide area network (WAN), and/or a public network (e.g.,the Internet), providing communication with other computing devices orsystems.

Data storage device 144 may store one or more programs 146, one or morecomputer readable program instructions 148, and/or data, etc. Thecomputer readable program instructions may be configured to carry outfunctions of embodiments of aspects of the invention.

Computer system 102 may include and/or be coupled toremovable/non-removable, volatile/non-volatile computer system storagemedia. For example, it may include and/or be coupled to a non-removable,non-volatile magnetic media (typically called a “hard drive”), amagnetic disk drive for reading from and writing to a removable,non-volatile magnetic disk (e.g., a “floppy disk”), and/or an opticaldisk drive for reading from or writing to a removable, non-volatileoptical disk, such as a CD-ROM, DVD-ROM or other optical media. Itshould be understood that other hardware and/or software componentscould be used in conjunction with computer system 102. Examples,include, but are not limited to: microcode, device drivers, redundantprocessing units, external disk drive arrays, RAID systems, tape drives,and data archival storage systems, etc.

Computer system 102 may be operational with numerous other generalpurpose or special purpose computing system environments orconfigurations. Examples of well-known computing systems, environments,and/or configurations that may be suitable for use with computer system102 include, but are not limited to, personal computer (PC) systems,server computer systems, thin clients, thick clients, handheld or laptopdevices, multiprocessor systems, microprocessor-based systems, set topboxes, programmable consumer electronics, network PCs, minicomputersystems, mainframe computer systems, and distributed cloud computingenvironments that include any of the above systems or devices, and thelike.

Further details regarding one example of processor 104 are describedwith reference to FIG. 1B. Processor 104 includes a plurality offunctional components used to execute instructions. These functionalcomponents include, for instance, an instruction fetch component 150 tofetch instructions to be executed; an instruction decode unit 152 todecode the fetched instructions and to obtain operands of the decodedinstructions; instruction execution components 154 to execute thedecoded instructions; a memory access component 156 to access memory forinstruction execution, if necessary; and a write back component 160 toprovide the results of the executed instructions. One or more of thesecomponents may, in accordance with an aspect of the present invention,be used to execute one or more operations and/or instructions to managefloating point controls 166, and/or other operations/instructionsassociated therewith.

Processor 104 also includes, in one embodiment, one or more registers168 to be used by one or more of the functional components. Processor104 may include additional, fewer and/or other components than theexamples provided herein.

Additional details regarding a processor are described with reference toFIG. 1C. In one example, a processor, such as processor 104, is apipelined processor that may include prediction hardware, registers,caches, decoders, an instruction sequencing unit, and instructionexecution units, as examples. The prediction hardware includes, forinstance, a local branch history table (BHT) 105 a, a global branchhistory table (BHT) 105 b, and a global selector 105 c. The predictionhardware is accessed through an instruction fetch address register(IFAR) 107, which has the address for the next instruction fetch.

The same address is also provided to an instruction cache 109, which mayfetch a plurality of instructions referred to as a “fetch group”.Associated with instruction cache 109 is a directory 111.

The cache and prediction hardware are accessed at approximately the sametime with the same address. If the prediction hardware has predictioninformation available for an instruction in the fetch group, thatprediction is forwarded to an instruction sequencing unit (ISU) 113,which, in turn, issues instructions to execution units for execution.The prediction may be used to update IFAR 107 in conjunction with branchtarget calculation 115 and branch target prediction hardware (such as alink register prediction stack 117 a and a count register stack 117 b).If no prediction information is available, but one or more instructiondecoders 119 find a branch instruction in the fetch group, a predictionis created for that fetch group. Predicted branches are stored in theprediction hardware, such as in a branch information queue (BIQ) 125,and forwarded to ISU 113.

A branch execution unit (BRU) 121 operates in response to instructionsissued to it by ISU 113. BRU 121 has read access to a condition register(CR) file 123. Branch execution unit 121 further has access toinformation stored by the branch scan logic in branch information queue125 to determine the success of a branch prediction, and is operativelycoupled to instruction fetch address register(s) (IFAR) 107corresponding to the one or more threads supported by themicroprocessor. In accordance with at least one embodiment, BIQ entriesare associated with, and identified by an identifier, e.g., by a branchtag, BTAG. When a branch associated with a BIQ entry is completed, it isso marked. BIQ entries are maintained in a queue, and the oldest queueentry (entries) is (are) de-allocated sequentially when it is marked ascontaining information associated with a completed branch. BRU 121 isfurther operatively coupled to cause a predictor update when BRU 121discovers a branch misprediction.

When the instruction is executed, BRU 121 detects if the prediction iswrong. If so, the prediction is to be updated. For this purpose, theprocessor also includes predictor update logic 127. Predictor updatelogic 127 is responsive to an update indication from branch executionunit 121 and configured to update array entries in one or more of thelocal BHT 105 a, global BHT 105 b, and global selector 105 c. Thepredictor hardware 105 a, 105 b, and 105 c may have write ports distinctfrom the read ports used by the instruction fetch and predictionoperation, or a single read/write port may be shared. Predictor updatelogic 127 may further be operatively coupled to link stack 117 a andcount register stack 117 b.

Referring now to condition register file (CRF) 123, CRF 123 isread-accessible by BRU 121 and can be written to by the execution units,including but not limited to, a fixed point unit (FXU) 141, a floatingpoint unit (FPU) 143, and a vector multimedia extension unit (VMXU) 145.A condition register logic execution unit (CRL execution) 147 (alsoreferred to as the CRU), and special purpose register (SPR) handlinglogic 149 have read and write access to condition register file (CRF)123. CRU 147 performs logical operations on the condition registersstored in CRF file 123. FXU 141 is able to perform write updates to CRF123.

Processor 104 further includes a load/store unit 151, and variousmultiplexors 153 and buffers 155, as well as address translation tables157, and other circuitry.

Executing within processor 104 are applications or routines that employmathematical libraries to perform certain mathematical operations,including floating point operations. With floating point operations,there are various controls that may be set for the operations,including, for example, a rounding mode control, such asround-to-nearest, round towards the nearest with ties to even, roundtowards zero, round towards plus infinity, round towards minus infinity,etc.

Certain mathematical libraries use particular rounding modes that mayreturn incorrect or implausible results. Therefore, code has been addedto the libraries and/or to routines calling the libraries to change therounding mode to one that provides correct results. For instance, therounding mode may be changed to round-to-nearest. Other examples alsoexist.

One example of code used to change or set the rounding mode (rm) is asfollows:

math( ) { old_rm = read_rm( ) set_rm(ROUND_TO_NEAREST); do math;set_rm(old_rm); }

Further details regarding executing this code are described withreference to FIG. 2A. As shown, initially the old or current roundingmode is read from, e.g., the floating point (FP) control register, andstored in old_rm (e.g., old_rm=read_rm( ), STEP 200. This operationincludes performing serialization to cease processing of the processorsthat may access the floating point control register, STEP 202, and thenreading the floating point control register and storing the read valuein old_rm, STEP 204. Thereafter, a set rm instruction is used to set therounding mode to a selected rounding mode, such as round to the nearest(e.g., set_rm(ROUND_TO_NEAREST)), STEP 210. Again, this includes aserialization process 212, and setting the rounding mode of the floatingpoint control register to round-to-nearest, STEP 214. After the roundingmode is set, one or more mathematical operations are performed, STEP220, and then the rounding mode is set back to the old rounding mode(e.g., set_rm(old_rm)), STEP 230. Again, this includes a serializationprocess, STEP 232, and then, setting the rounding mode of the floatingpoint control register to the value of old_rm, STEP 234.

In a further embodiment, to reduce the overhead associated withperforming the set rounding mode operation, another coding pattern isprovided that tests for the rounding mode and only executes the code tochange the rounding mode when necessary. One example of this code isshown below:

my_math_function( ) { rounding_mode = non_sync_read_fp_state( ); if(rounding_mode != ROUND_TO_NEAREST) set_fp_state(ROUND_TO_NEAREST); dowork; if (rounding mode != ROUND_TO_NEAREST) set_fp_state(rounding_mode); } where != refers to not equal.

As shown in FIG. 2B, with this execution, old_rm is set equal to thecurrent rounding mode (e.g., old_rm=read_rm( ), STEP 250. This includes,e.g., reading the rounding mode from the floating point control registerand setting old_rm to the read rounding mode, STEP 252. In this example,that operation is a non-serialized operation. Then, a determination ismade as to whether the old rounding mode is equal to a selected roundingmode, such as round_to_nearest (e.g., old_rm==ROUND_TO_NEAREST), INQUIRY260. If the rounding mode is not already set to the selected roundingmode, round to_nearest, then a set rounding mode instruction is used toset the rounding mode to the selected rounding mode, e.g.,round_to_nearest (e.g., set_rm(ROUND_TO_NEAREST)), STEP 270. Thisincludes, for instance, performing serialization to cease processing ofthe processors, STEP 272, and setting the rounding mode in the floatingpoint control register to round_to_nearest, STEP 274. Thereafter, or ifthe rounding mode is already set to the selected rounding mode, e.g.,round_to_nearest, one or more mathematical operations are performed,STEP 276, and then, a further determination is made as to whether theold rounding mode is set to the selected rounding mode, e.g.,round_to_nearest (e.g., old_rm==ROUND_TO_NEAREST), INQUIRY 280. If it isnot set to the selected rounding mode, e.g., round_to_nearest, then itis set to restore the rounding mode which was in use on entry to thefunction (e.g., set_rm(old_rm)), STEP 290, which includes performingserialization, STEP 292, and setting the rounding mode in the floatingpoint control register, STEP 294. Thereafter, or if the rounding mode isalready set to the selected rounding mode, e.g., round_to_nearest, thenprocessing returns, STEP 296.

While the above reduces some of the serialization, there are costsassociated with branch prediction and non-linear control flow. Further,although the examples herein describe updating a floating point controlregister, in other examples, the floating point controls may bemaintained in a location other than a register. Many possibilitiesexist.

In accordance with an aspect of the present invention, to reduce costsassociated with the serialization and branch prediction of the aboveexamples, an instruction is introduced that reads the existing floatingpoint controls (e.g., from the floating point control register) andsaves the read floating point controls in one operand and writes newfloating point controls to another operand, as described herein. Thisinstruction is referred to herein as a Read and Set FP (Floating Point)Status and Control (RSFPS) instruction or a Read and Set Floating PointControl instruction, also represented by read_and_set_fp_state( ). Oneembodiment of a format of this instruction is depicted in FIG. 3A. Asshown, a Read and Set FP Status and Control instruction 300 includes anoperation code (opcode) field 302 having an opcode indicating a read andset floating point control operation; a target operand (RT) 304, whichspecifies, for instance, a general purpose register to receive currentfloating point control values; and a source operand (RS) 306, whichspecifies updated floating point control values. In one embodiment, eachof the fields is separate from one another. However, in other examples,one or more fields may be combined. Further, in one implementation, theRead and Set FP control instruction is an architected machineinstruction. In one example, it is a single architected machineinstruction at the hardware/software interface.

In one example operation of the RSFPS instruction, the existing floatingpoint controls are read from, e.g., the floating point control register,and saved in the target operand, also referred to herein as old_fpoperand. This operand may be stored in a selected location, such as, forinstance, in a general purpose register, in memory, in a floating pointspecial purpose register, in a control register, in another register, oras an integer, as examples. Further, as part of the operation, theinstruction (e.g., as a single atomic unit) writes new floating pointcontrols specified by the source operand, also referred to as new_fpstate, to the floating point control register. Again, this operand maybe stored in a selected location, such as, for instance, in memory, in afloating point special purpose register, in a control register, in ageneral purpose register, in another register, or as an integer, asexamples.

In a further embodiment, the instruction includes a field that is usedto select one or more of the floating point controls to be read andsimultaneously write-updated. For example, a floating point roundingmode control may be selected and/or other controls, such as decimal FProunding mode, binary FP rounding mode, hexadecimal FP rounding mode,data exception code, etc.

One example of a format of a RSFPS instruction with such a field isdescribed with reference to FIG. 3B. In one example, a Read and Set FPStatus and Control instruction 320 includes an operation code field 322having an opcode indicating a read and set floating point controloperation; a target operand (RT) 324 to receive current floating pointcontrol values; a source operand (RS) 326 to specify updated floatingpoint control values; and at least one field 328 to be used to indicatethe specific floating point control to be read/updated. The field may bean immediate field of the instruction which includes the specificfloating point control, or the field may include an indication of alocation (e.g., in memory, a general purpose register, a special purposeregister, etc.) that includes the specific floating point control. Othervariations are also possible.

In yet a further embodiment of the Read and Set FP Status and Controlinstruction, a bit mask is used to indicate a plurality of floatingpoint controls to be read and updated. One example of this format isdepicted in FIG. 3C. As shown, in one example, a Read and Set FP Statusand Control instruction 330 includes an operation code field 332 havingan opcode indicating a read and set floating point control operation; atarget operand (RT) 334 to receive current floating point controlvalues; a source operand (RS) 336 to specify updated floating pointcontrol values; and a field mask 338, which includes a bit mask for theplurality of floating point controls that may be updated. The bit maskincludes, for instance, a bit for each possible floating point controlto be selected to be updated, and if a particular bit is set to aparticular value, such as one, then that particular control is read andupdated. Other variations are possible. The field mask may be includedin an immediate field of the instruction, or the field mask field of theinstruction may include an indication of a location (e.g., in memory, ageneral purpose register, a special purpose register, etc.) thatincludes the mask. Other variations are also possible.

As described herein, the Read and Set Floating Point Status and Controlinstruction reduces the number of instructions and operations to beperformed to update the floating point controls. For example, the Readand Set Floating Point Status and Control instruction reads the floatingpoint control register and updates the floating point control registerwith the values of the source operand as part of one instruction, i.e.,as one atomic operation. This reduces the amount of serialization thatis needed, as described with reference to FIGS. 4A-4B.

As shown in FIG. 4A, a conventional technique for updating the roundingmode of the floating point controls includes reading the currentrounding mode and storing it in old_rm (e.g., old_rm=read_rm( ), STEP400. This operation includes performing serialization to ceaseprocessing of the processors that may access the floating point controlregister, STEP 402, and then reading the floating point (FP) controlregister and storing the read value in old_rm, STEP 404. Thereafter, aset_rm instruction is used to set the rounding mode to a selectedrounding mode, such as round-to-nearest (e.g.,set_rm(ROUND_TO_NEAREST)), STEP 410. Again, this includes aserialization process 412, and setting the rounding mode of the floatingpoint control register to round-to-nearest, STEP 414.

In contrast, as shown in FIG. 4B, by using the Read and Set FloatingPoint Status and Control instruction 440 to set the rounding mode toround_to_nearest (Note: One or more fields of the instruction are notdepicted), one serialization process is performed, STEP 442. Then, thefloating point controls, including rounding mode, are read, STEP 444,and at least the rounding mode control is updated, STEP 446. Theadditional serialization (e.g., serialization 412) is not needed orused. Therefore, the Read and Set FP Status and Control instructionfacilitates processing by performing the update absent at least oneserialization process; thereby, enhancing performance within thecomputing environment.

As indicated above, in one embodiment, one or more controls areexplicitly specified for reading and updating. Thus, rather than readingthe entire set of controls or the entire floating point control registerand extracting the fields using software instructions (such as shift andmasking), only a single field (or a plurality of explicitly specifiedfields) is read. Advantageously, synchronization is only performed onthe one or more indicated fields. This is further described withreference to FIG. 5.

As shown in FIG. 5, based on executing a Read and Set Floating PointStatus and Control instruction (Note: One or more fields of instructionare not depicted) that specifies a particular field to be updated (e.g.,control_field), a determination is made as to whether an update isalready pending for that particular field, INQUIRY 500. For instance, acounter of pending updates for that field may be checked. If there is noupdate already pending, then serialization is not performed, and a term,RESULT, is set equal to the current value of the specified field of thefloating point control in the floating point control register, STEP 502.In at least one embodiment, RESULT corresponds to an operand specifiedby the Read and Set Floating Point Status and Control instruction (e.g.,the target (RESULT) register RT). Further, the specified field of thefloating point control is set equal to an updated value (e.g.,update_value 505), which is specified, e.g., in the source operand ofthe instruction, STEP 504. In at least one embodiment, the update valuecorresponds to an operand specified by the Read and Set Floating PointStatus and Control instruction (e.g., the source (SOURCE) register RS).Further, readers of the particular floating point control being updatedare serialized (i.e., they wait for the control field to be updatedbefore accessing the field), STEP 506.

Returning to INQUIRY 500, if an update is already pending for thisparticular floating point control_field, then serialization relative tothe updated field is performed (e.g., forcing processing to completeprior to reading), STEP 510. Further, the floating point control_fieldis read from the floating point control register, STEP 512, and updated,STEP 514.

As described above, a Read and Set Floating Point Status and Controlinstruction is provided that enables a specification of one or morefields to be updated; thereby, reducing the amount of instructions to beexecuted and avoiding the need to wait on the completion of instructionsthat set unrelated fields. In one implementation, the instruction forcesthe completion of previous floating point instructions and holds backsubsequent instructions. However, it is determined that frequently(e.g., over 95% of executions in common applications) the new and oldrounding mode are the same. Thus, in accordance with an aspect of thepresent invention, there is provided an implementation of the rsfpsinstruction with an accelerated null update. The instruction is eitherselected automatically in the micro-architecture, based on receiving anrspfs instruction, or a separate rsfps_fn instruction (rsfps with fastnull update) is provided. In one embodiment, the specified fields of thersfps or rsfps_fn instruction are read by the instruction, and acomparison of the current values of the specified fields with the newlyto be written field values is performed. If the new values are the sameas the old values, the instruction completes, and the old values arewritten to the target register. Further details regarding thisprocessing are described with reference to FIG. 6.

Referring to FIG. 6, in one embodiment, upon receipt of an rsfps_fninstruction (or an rsfps instruction to be treated as an rspfs_fninstruction), a determination is made as to whether there is an updatepending for the control field (or control fields) specified in theinstruction, INQUIRY 600. If there is no update already pending for thecontrol field, then serialization is not performed and a term, RESULT,is set equal to the current value of the specified field of the floatingpoint control, STEP 602. Then, a determination is made as to whether thevalue of RESULT equals the value of the source operand, INQUIRY 604. Inone embodiment, the RESULT term corresponds to a target register RT ofthe instruction, and the source operand corresponds to a source registerRS of the instruction. In other embodiments, source and/or target maycorrespond to memory operands, special purpose registers, or otheroperand specifiers. If RESULT equals the value of the source operand,then processing is complete, STEP 606. That is, no update orserialization of readers of the specified field is performed. Otherwise,the specified floating point control is set, STEP 608. For instance, thespecified control field is set to the source value of the instruction.Thereafter, the readers that use that control field are serialized, STEP610. In another embodiment, all floating point instructions may beserialized. Other implementations also exist.

Returning to INQUIRY 600, if there is a current update pending for thecontrol field, then serialization relative to the field being updated isperformed, STEP 620. For instance, updates to the control field are tocomplete before processing continues; and readers of the control fieldare serialized. In other embodiments, all floating point instructionsmay be serialized. Other implementations are also possible. Thereafter,RESULT is set equal to the current value of the control field, STEP 622,and the floating point control field is set to the new value, STEP 624.For instance, the control field is set to the value of the sourceoperand of the instruction. This completes processing.

Although the above processing describes updating one control field,similar processing may be performed for a plurality of control fields.

In a further embodiment, the old value is speculatively written as acopy of the new value even before the check, and thus, dependentinstructions may proceed immediately. Further, in one embodiment,floating point compute instructions (but not other rsfps or otherinstructions that may update the specified fields) are allowed to passthe rsfps_fn instruction, so there is no restriction of schedulingfreedom for traditional floating point instructions.

Further details regarding the Read and Set Floating Point Status andControl instruction with an optimized null update are described withreference to FIG. 7. Based on receipt of an rsfps_fn instruction (or anrsfps instruction to be implemented as an rsfps_fn instruction), RESULTis set equal to the source value of the control field specified by theinstruction, STEP 700. The setting of RESULT may be executedout-of-order (e.g., as a first internal operation) allowing instructionsdependent on RESULT and the floating point control to execute.Thereafter, a determination is made as to whether processing is to waitfor an in-order point, INQUIRY 702. In one example, a state machine maybe used to determine when the in-order point is reached. If processingis to wait for an in-order point, processing just waits. Otherwise, orsubsequent to reaching an in-order point, a term, FP_control, is setequal to the value in the control register of the control fieldspecified by the instruction, STEP 704. Then, a determination is made asto whether FP_control is equal to the value of the source operand of theinstruction, INQUIRY 706. That is, is FP_control equal to what the userrequested? If yes, then processing is complete, since speculation wascorrect (i.e., the use of RESULT was proper and there was no change tothe FP control register, which has the user-specified value of thesource already), STEP 708. Otherwise, there is a mispeculation and theinstructions in the pipeline are flushed, STEP 710. In one embodiment,all instructions after the present instruction are flushed. In anotherembodiment, instructions depending on RESULT and floating pointinstructions are flushed. In yet another embodiment, instructionsdepending on RESULT and on the floating point control are flushed.Various possibilities exist. RESULT is then set equal to the currentvalue of the specified floating point control (e.g., read in STEP 704),STEP 712, and the field specified by control_field in the floating pointcontrol register is set equal to the value of the source operand, STEP714.

In one embodiment, when a mismatch of old and new values is discovered,recovery actions are taken. In one embodiment, the rsfps_fn instructioneither stalls or is rejected and held to execute at the in-order point.Simultaneously, instructions following the rsfps_fn instruction areflushed and initialized to be re-executed in-order after the rsfps_fninstruction. In another embodiment, the first floating point instructionafter the rsfps_fn and subsequent instructions (or subsequent floatingpoint instructions) are flushed and initialized to be re-executedin-order after the rsfps_fn instruction. In another embodiment, thefirst floating point instruction after rsfps_fn that has been executedout-of-sequence and ahead of the rsfps_fn instruction and subsequentinstructions (or subsequent floating point instructions) are flushed andinitialized to be re-executed in-order after the rsfps_fn instruction.

The rsfps_fn instruction updates the old_fp operand (also referred toherein as RESULT) with the values retrieved from the floating pointcontrol for at least those fields specified and updates the floatingpoint control (specified floating point control fields) at the in-orderexecution point (e.g., when it is at a next-to-complete in theinstruction sequencing unit). When the rsfps_fn instruction haspreviously written a speculative value to the old_fp operand by copyingthe new_fp (also referred to herein as SOURCE) state, speculating thatno change will occur, it overwrites the speculatively written old_fpoperand value with the correct floating point operand value. Then,instructions following the rsfps_fn instruction are flushed andinitialized to be re-executed in order after the rsfps_fn instruction.Alternatively, instructions following the rsfps_fn instruction that haveread the old floating point state are flushed and initialized to bere-executed in-order after the rsfps_fn instruction. The rsfps_fninstruction completes and execution continues.

In one example, for a null update (i.e., the updated value is the sameas the current value), a read is performed to check if the update isnull, and a conditional branch is performed to skip the synchronizingupdate if it is null. Then, at restore time, a determination is onceagain made to check whether there is something to be restored, and aconditional branch may be performed around the update. Therefore, inaccordance with one aspect of the present invention, a non-synchronizingupdate is performed when the update is a null update (i.e., no change tothe current settings). An instruction with a non-synchronizing (free)null update may enable code as follows:

my_math_function( ) { rounding_mode = non_sync_read_fp_state( );set_fp_state(ROUND_TO_NEAREST): do work; set_fp_state(rounding_mode); }

As described above, various aspects of the present invention provide twoinstructions: the rsfps and the rsfps_fn instructions. Thus, programmersmay choose between one or the other. However, runtime information maynot be available to the programmer; customers in different applicationspaces may have different needs; and/or application profiles may changeover time. Therefore, the programmer may make an incorrect decision inselecting one of the rsfps and rsfps_fn instruction variants thatnegatively affects performance. Thus, in accordance with one aspect ofthe present invention, a read and set floating point state withpredicted fast null update operation is provided. As examples, a newinstruction, Read and Set FP State with Predicted Fast Null Update(rsfps_pfn), is provided; and in other embodiments, one or both of thersfps and rsfps_fn instructions trigger the execution of the rsfps_pfntechnique. The rsfps⁻pfn instruction may have a plurality ofimplementations, including, for instance: rsfps_pfn old₁₃ fp, new_fp;rsfps_pfn old_fp, new_fp, <field>; rsfps_pfn old_fp, new_fp <fieldmask>, similar to the rsfps examples. When the rsfps_pfn technique isinvoked, a predictor is queried to make a prediction. The prediction iseither TRUE or FALSE and corresponds to whether performing the rspfsinstruction form with fast null update is desirable or not. When theprediction is made and the prediction is TRUE, the rsfps_pfn techniqueinvokes the rsfps_fn technique of performing a floating point statusupdate with a fast null update. (In another embodiment, a FALSE maytrigger this update technique.) A test is made as to whether a nullupdate occurred, and then, the predictor is updated. In otherembodiments, based on receiving an rsfps_pfn instruction, decode logicgenerates one of two internal instructions corresponding to thedescription of the functions described for rsfps_fn and rsfpshereinabove, when the predictor indicates whether a fast null updatewill be beneficial (e.g., TRUE) or not (e.g., with the predictionFALSE).

Further, in one example, when the prediction is made and the predictionis FALSE, the rsfps_pfn technique invokes the rsfps_fn technique ofperforming a floating point control update without a fast null update.(In another embodiment, TRUE triggers this update technique.) A test ismade as to whether a null update occurred, and then, the predictor isupdated.

A variety of predictor architectures may be used. Any of the known orfuture proposed predictor architectures may be used in conjunction withaspects of the invention. For instance, single bit or multi-bitpredictors with hysteresis may be used. Symmetric decisions may be madefor multi-bit predictors (equally many states encoded by the bitsreflecting TRUE or FALSE), or asymmetric decisions may be made (morestates for one of TRUE or FALSE at the expense of fewer for otherstates). The same predictor may be used for rsfps_pfn and otherinstructions (e.g., branches). Different predictors may be used.Different predictor architectures may be used. Different predictorarrays may be used. Same predictor arrays, but different predictors andpredictor architectures may be used. Many variations are possible.Further details regarding one embodiment of using prediction aredescribed with reference to FIGS. 8A-8B.

Referring initially to FIG. 8A, a prediction is obtained, STEP 800, anda determination is made as to whether null update is predicted, INQUIRY802. If null update is predicted, then RESULT is set equal to the sourcevalue of the control field specified by the instruction, STEP 804. Thesetting of RESULT may be executed out-of-order (e.g., as a firstinternal operation) allowing instructions dependent on RESULT and thefloating point control to execute. Thereafter, a determination is madeas to whether processing is to wait for an in-order point, INQUIRY 806.In one example, a state machine may be used to determine when thein-order point is reached. If processing is to wait for an in-orderpoint, processing just waits. Otherwise, or subsequent to reaching anin-order point, FP_control is set equal to the value in the controlregister of the control field specified by the instruction, STEP 808.Then, a determination is made as to whether FP_control is equal to thevalue of the source operand of the instruction, INQUIRY 810. That is, isFP_control equal to what the user requested? If yes, then the predictormay be updated to indicate that a null update has been performedsuccessfully, STEP 812, and processing is complete, since speculationwas correct, STEP 814. Otherwise, there is a mispeculation and theinstructions in the pipeline are flushed, STEP 816. In one embodiment,all instructions after the present instruction are flushed. In anotherembodiment, instructions depending on RESULT and floating pointinstructions are flushed. In yet another embodiment, instructionsdepending on RESULT and on the floating point control are flushed.Various possibilities exist. RESULT is then set equal to the currentvalue of the specified floating point control, STEP 818, and thefloating point control is set equal to the value of the source operand,STEP 820. Further, the predictor is updated to indicate that a nullupdate was not performed, STEP 822.

Returning to INQUIRY 802, if a null update is not predicted, then adetermination is made as to whether there is an update pending for thecontrol field (or control fields) specified in the instruction, INQUIRY830. If there is no update already pending for the control field, thenserialization is not performed and RESULT is set equal to the currentvalue of the specified field of the floating point control, STEP 832.Then, a determination is made as to whether the value of RESULT equalsthe value of the source operand, INQUIRY 834. If RESULT equals the valueof the source operand, then the predictor is updated to indicate nullupdate, STEP 836, and processing is complete. That is, no update of thefloating point control or serialization of readers of the floating pointcontrol is performed. Otherwise, if RESULT does not equal SOURCE, thespecified floating point control is set, STEP 838. For instance, thespecified control field is set to the source value of the instruction.Thereafter, the readers that use that control field are serialized, STEP840. In another embodiment, all floating point instructions may beserialized. Other implementations also exist. Further, the predictor isupdated to indicate no null update, STEP 842.

Returning to INQUIRY 830, if there is a current update pending for thecontrol field, then serialization relative to the field being updated isperformed, STEP 850. For instance, updates to the control field are tocomplete before processing continues; and readers of the control fieldare serialized. In other embodiments, all floating point instructionsmay be serialized. Other implementations are also possible. Thereafter,RESULT is set equal to the current value of the control field, STEP 852,and the floating point control field is set, STEP 854. For instance, thecontrol field is set to the value of the source operand of theinstruction. Additionally, the predictor is updated depending on whetherthe update changed the floating point control value for the selectedfield. For instance, if the update changed the floating point controlvalue for the selected field (SOURCE !=RESULT), the predictor is updatedto indicate that a null update was not performed (i.e., NO_NULL_UPDATE);and if the update did not change the floating point control value forthe selected field (SOURCE==RESULT), the predictor is updated toindicate that a null update was performed (i.e., NULL_UPDATE), STEP 856.This completes processing.

Although the above processing describes updating one control field,similar processing may be performed for a plurality of control fields.In other embodiments, an instruction may specify multiple fields to beso processed, in accordance with embodiments of the invention describedherein. In yet other embodiments, no field(s) may be specified and thefloating point control register may be updated in its entirety inaccordance with aspects described herein.

As described herein, programmers are to set the rounding mode and/orother controls prior to a floating point operation. However, inaccordance with another aspect of the present invention, a capability isprovided to manage the rounding mode or other floating point control tobe used by an instruction, absent the cost of setting the rounding modeor other control in the floating point control register. This capabilityincludes employing a control prefix, such as a rounding mode prefix,that indicates no matter what value the machine has set for thatfloating point control, floating point operations are to be executedwith the user-specified control, e.g., round-to-nearest, withoutupdating a global resource, such as the floating point control register.This reduces the cost of updating global resources. The control prefix,such as the rounding mode prefix, precedes an instruction. For instance,a prefix may be added in front of an instruction, such as:

ROUND_NEAREST FADD RT, RS1, RS2

In this example, Round_Nearest is placed in front of a floating pointadd (FADD) instruction.

As another example, a Round_Up prefix is placed in front of a floatingpoint multiplication (FMUL) instruction:

ROUND_UP FMUL RT, RS1, RS2

Many other examples are possible.

In accordance with one embodiment, the control prefix is decoded inconjunction with an instruction. For instance, a “perform instructionwith fixed controls, such as fixed rounding mode” internal instructionis generated. The control, such as the rounding mode, is obtained fromthe prefix. The control, such as the rounding mode, is used in executingthe instruction, in lieu of the rounding mode in the control register.

In one or more embodiments, prefix instructions may be included in aninstruction stream and decoded as part of that stream. Example prefixinstructions are described with references to FIGS. 9A-9D. Referring toFIG. 9A, in one embodiment, a prefix instruction 900 includes a floatingpoint control prefix indicator (e.g., an opcode) 902 indicating a prefixoperation; a floating point control field indicator 904 specifying afloating point control to be user-specified; and a floating controlfield value 906 indicating a user-specified value for the control. Anexample of the floating point control field indicator is rounding mode,and example control field values include nearest, up, down, to_zero,away_from_0, etc. Other controls and/or other values may be provided.

In another embodiment with reference to FIG. 9B, a prefix instruction910 includes a floating point control prefix indicator 912, and afloating point control indicator 914. In this example, the field andvalue are combined into one field. As examples, the floating pointcontrol indicator includes round_to_nearest, round_up, round_down,indicate_imprecise, etc.

In yet another embodiment with reference to FIG. 9C, a prefixinstruction 920 includes a floating point prefix indicator 922, and oneor more floating point control fields 924, in which a value may bespecified in each field. In one example embodiment, each control fieldconsists of an indicator (e.g., 904) and a value (e.g., 906). In anotherexample embodiment, each control field is an FP control indicator (e.g.,914). In one such example embodiment, the fields are positional, forexample, the first field may be specified to provide rounding, thesecond field to provide NaN handling, and so forth. Yet otherembodiments are possible in accordance with the teachings herein.

In yet a further embodiment with reference to FIG. 9D, a prefixinstruction 930 includes a floating point control prefix indicator 932;a plurality of enable masks 934; and a plurality of control fields 936.In this example, the mask that precedes the control field indicateswhether the value in the field is to be used instead of the value in thecontrol register. For instance, if the mask value is set to e.g., 1,then the value in the succeeding control field is used, instead of thevalue in the control register. Many possibilities exist.

Although various embodiments of a prefix instruction are providedherein, other variations may be used without departing from one or moreaspects of the present invention. Further, each instruction may havemore, fewer and/or different fields. Many possibilities exist.

Further details relating to using a prefix instruction are describedwith reference to FIG. 10. In one example, it is the decode logic thatperforms this processing. Initially, an instruction is obtained from thefetched instruction stream, STEP 1000, and a determination is made as towhether the fetched instruction is a floating point prefix indicatorinstruction (e.g., based on the opcode or one or more other parameters),INQUIRY 1002. If it is not a prefix instruction, then a furtherdetermination is made as to whether the instruction is a floating pointinstruction (e.g., based on the opcode or one or more other parameters),INQUIRY 1004. If it is a floating point instruction, then internaloperations are generated for the floating point instruction using thefloating point control register for the controls, STEP 1006. However, ifthe instruction is not a floating point instruction, then conventionalinstruction decode is performed, STEP 1008.

Returning to INQUIRY 1002, if the instruction is a floating point prefixindicator, then the floating point control indicators are obtained fromthe instruction, STEP 1020. Thereafter, another instruction (e.g., anext instruction) is obtained from the instruction stream, STEP 1022,and a determination is made as to whether the instruction is a floatingpoint instruction, INQUIRY 1024. If it is a floating point instruction,then internal operations are generated for the floating pointinstruction using values of the floating point control prefix indicatorinstruction for at least one control, STEP 1026. However, returning toINQUIRY 1024, if the instruction is not a floating point instruction,then a decode error is indicated, STEP 1028. As an example, based onindicating the decode error, error correction may be performed, and thismay include performing no error processing and processing theinstruction that was fetched; raising an exception; or performing someother processing. Other possibilities exist.

Subsequent to generating the internal operations, the internaloperations are executed to perform the operation specified by thefloating point instruction.

In further embodiments, a prefix or prefix instruction to indicate aparticular control, such as rounding mode or another control, may beplaced in front of specific types of floating point instructions,including, but not limited to, binary floating point instructions,decimal floating point instructions, hexadecimal floating pointinstructions, and/or vector floating point instructions. The prefixmodifies the controls, e.g., rounding mode, used for executing thatparticular instruction. Further details regarding processing that may beused for different types of floating point instructions, includingbinary, decimal, hexadecimal, and/or others, are described withreference to FIG. 11.

Referring to FIG. 11, initially, in one implementation, a determinationis made as to whether a prefix indicates a rounding mode control,INQUIRY 1100. If not, then a determination is made as to whether theprefix indicates one or more other controls, INQUIRIES 1102, 1104. Ifother controls are indicated, then processing is performed commensuratetherewith. Returning to INQUIRY 1100, if the prefix indicates a roundingmode control, then a determination is made as to whether the prefixinstruction is for a binary floating point instruction, INQUIRY 1110. Ifit is, then the binary floating point rounding mode control is set tothe prefix rounding mode, STEP 1112. Returning to INQUIRY 1110, if it isnot a prefix for a binary floating point instruction, then a furtherdetermination is made as to whether it is a prefix for a decimalfloating point instruction, INQUIRY 1120. If so, then the decimalfloating point rounding mode control is set to the prefix rounding mode,STEP 1122. Yet further, returning to INQUIRY 1120, if the prefixinstruction is not for a decimal floating point instruction, then afurther determination is made as to whether the prefix is for ahexadecimal floating point instruction, INQUIRY 1130. If it is, then thehexadecimal floating point rounding mode control is set to the prefixrounding mode, STEP 1132. The same processing may be performed for othertypes of floating point instructions, including vector floating pointinstructions or others. Many variations are possible.

Using a single prefix that modifies the behavior of a plurality ofclasses in a manner adapted to those instructions (e.g., when a roundingmode is specified, modify the binary FP rounding mode when the prefix isa prefix to a binary FP instruction; modify the hexadecimal FP roundingmode when the prefix is a prefix to a hexadecimal FP instruction; and soforth) reduces the size of prefixes and simplifies the generating ofprefixed instructions.

As indicated, prefixes may be used for various controls, includingrounding mode and/or other controls. In one aspect of the presentinvention, prefixes are used to provide fine-grained processing forfloating point controls, such as floating point exceptions. A floatingpoint exception is, e.g., an indication that a special event hasoccurred. The exception may be indicated by setting one or moreindicators, such as one or more bits, in the floating point controlregister. For instance, conventionally, floating point exceptions mayeither be enabled or disabled based on an update to the floating pointcontrol register, and in particular, to the floating point exceptioncontrol bits of that register. Users control the raising of exceptionsby writing control enable bits. Users may ignore updates to the floatingpoint status bits by reading the status bits prior to execution of afloating point instruction, and rewriting them back to the floatingpoint control register after the instruction executes. To avoid suchupdates and any expenses associated therewith, which may affectapplication performance, in accordance with an aspect of the presentinvention, fine-grained control of exception enablement (or othercontrols) is provided.

In accordance with one aspect, a fine-grained floating point controlprefix is provided. The floating point control prefix enables, e.g., thedisabling or enabling of the reading of floating point exceptions. Inone embodiment, floating point exceptions are controlled by a singleprefix and all exceptions are either enabled or disabled by theirprefix. One example of adding a prefix to a floating point addinstruction is as follows:

EXCEPTION_ENABLE ILLEGAL, OVERFLOW FADD RT, RS1, RS2

This records register overflow and illegal operations for the next(prefixed) instruction. It does not record, e.g., underflow or impreciseresult indications for the next instruction.

In another embodiment, the prefix includes a bitmap of floating pointcontrol bits to be enabled or disabled. In yet another embodiment, theindicated enabled or disabled bits are cumulative to the status of thefloating point control register; i.e., the status bits indicated to beat least one of enabled or disabled or combined with the enablement anddisablement status of the floating point controls. This enables aprogrammer to enable a control, disable a control, or specify to use thecontrol value of the FP control register. An example of this is thefollowing equation in which the FP status enablement control,fp_status_enablement, is combined with prefix-specified enable anddisable bits, to yield an effective enablement value that controls theoperation:

effective_enablement=fp_status_enablement &prefix_disabled|prefix_enabled

where & is an AND operation and|is an OR operation.

In one embodiment, one prefix may enable one or more fields, and anotherprefix may disable one or more fields. In one embodiment, multipleprefixes may be combined to affect an instruction. Many variations arepossible.

In yet another embodiment, a floating point exception recording controlmay be provided, such as:

FP_RECORD STICKY_OVERFLOW, ILLEGAL FADD RT, RS1, RS2

This records an overflow in a sticky overflow, and records an illegaloperation in a non-sticky overflow.

Again, other examples are possible.

In addition or in lieu of adding prefixes to an instruction, prefixinstructions may be added to an instruction stream prior to theinstruction to be controlled by the prefix instruction. Example prefixinstructions to manage one or more controls, such as exceptions, aredescribed with reference to FIGS. 12A-12D.

Referring to FIG. 12A, one example of a control prefix instruction 1200includes a floating point control prefix indicator 1202 (e.g., anopcode); one or more floating point exception indicators 1204 eachspecifying a floating point exception to be user-specified; and one ormore floating point exception indicator values 1206 each indicating auser-specified value for the control. Example indicators include, forinstance, exception type Imprecise, Overflow, Underflow, NaN, StickyImprecise, Sticky Overflow, Sticky Underflow, Sticky NaN. Exampleindicator values include Enabled or Disabled. Other indicators and/orvalues may be used.

In yet another embodiment with reference to FIG. 12B, a floating pointcontrol prefix instruction 1220 includes a floating point control prefixindicator 1222, and one or more floating point exception controlindicators 1224. In this example, the indicator and value are combinedinto one field. Example control indicators may be Enable_NaN,Disable_Overflow, etc.

In yet a further embodiment with reference to FIG. 12C, a control prefixinstruction 1230 includes a floating point control prefix indicator1232, and a plurality of floating point exception fields 1234. Eachfield may be for a different exception (e.g., Imprecise, Overflow,Underflow, NaN, Sticky Imprecise, Sticky Overflow, Sticky Underflow,Sticky NaN), and a value, such as Enabled or Disabled is specified foreach field.

In yet a further embodiment with reference to FIG. 12D, a floating pointcontrol prefix instruction 1240 includes a floating point control prefixindicator 1242; a plurality of masks fields 1244; and a plurality offloating point exception fields 1246. In this example, the mask field,when set to a particular value, such as one, indicates that the value ofthe exception field following the mask field is to be used, as opposedto the value in the control register.

Although various examples are provided, other implementations arepossible.

One or more of the above examples of exception prefix instructions maybe employed in the effective enablement embodiment described above. Forinstance, control prefix instruction 1200 may be used as follows: theremay be two exception type indicators, with one bit each corresponding to“<whatever exception> prefix-enabled” and another for “<whateverexception prefix-disabled>; or there may be a FP Exception indicator for“whatever exception>” that has two bits. The latter would have lessoverhead in providing names for each of the bits.

In another example, control prefix instruction 1220 may be used, inwhich there may be “<whatever exception>_on”, <whatever_exception>_off”and “<whatever exception_fpscr>,” each of which may yield a pair of twobits, e.g., disable/enable=11, 00, and 10, respectively.

In yet a further example, instruction 1230 may be used, in which theremay be one field for “<whatever exception> prefix-enabled” and anotherfor “<whatever exception prefix-disabled>”; or there may be a two-bitvalue, for “<whatever exception>”, one bit corresponding to the enabledand another for the disabled. Many possibilities exist.

Further details regarding using the exception prefix indicator aredescribed with reference to FIG. 13. In one example, it is the decodelogic that performs this processing. Initially, an instruction isobtained from the fetched instruction stream, STEP 1300, and adetermination is made as to whether the fetched instruction is afloating point prefix indicator instruction (e.g., based on the opcodeor one or more other parameters), INQUIRY 1302. If it is not a prefixindicator instruction, then a further determination is made as towhether the instruction is a floating point instruction (e.g., based onthe opcode or one or more other parameters), INQUIRY 1304. If it is afloating point instruction, then internal operations are generated forthe floating point instruction using the floating point control registerfor the controls, STEP 1306. However, if the instruction is not afloating point instruction, then conventional instruction decode isperformed, STEP 1308.

Returning to INQUIRY 1302, if the instruction is a floating point prefixindicator instruction, then, in one example, the floating point controlindicators (e.g., exception and associated value (e.g., disable/enable))are obtained from the prefix instruction, STEP 1320. Thereafter, anotherinstruction (e.g., a next instruction) is obtained from the instructionstream, STEP 1322, and a determination is made as to whether theinstruction is a floating point instruction, INQUIRY 1324. If thefetched instruction is a floating point instruction, then internaloperations are generated for the fetched floating point instructionusing the floating point control indicator for at least one control,STEP 1326. However, returning to INQUIRY 1324, if the instruction is nota floating point instruction, then a decode error is indicated, STEP1328. As examples, based on indicating the decode error, errorcorrection may be performed and this may include doing no errorprocessing and processing the instruction that was fetched; raising anexception, or performing some other processing. Other possibilitiesexist.

In yet a further embodiment, a prefix may be provided that combines oneor more control values, including rounding mode, exception suppression,and/or other values. Many variations are possible.

In yet further embodiments, an exception control mode can be placed infront of different types of floating point instructions, includingdecimal floating point instructions, hexadecimal floating pointinstructions, binary floating point instructions, and vector floatingpoint instructions, as examples. The placing of an exception controlmode prefix in front of a particular instruction modifies the exceptionmode used for executing that particular instruction. Other examples arealso possible.

In accordance with yet a further aspect of the present invention,compiler controls may be provided for program regions (e.g., a sequenceof instructions). Specifying such controls enables programmers tospecify floating point controls to be used during code generation whichmay be translated directly into prefixes, in one embodiment. Thisenables compilers to generate code with floating point control andallotting point exception prefixes in accordance with aspects of thepresent invention. In accordance with another aspect of the presentinvention, a compiler may generate floating point control registerupdates for a processor where floating point control and floating pointexception prefixes are not available. High level languages (e.g.,computer languages other than assembly) have not previously offered acapability for specifying controls, such as rounding mode, etc., to aninstruction sequence of a statically defined instruction range. Thus, inaccordance with an aspect of the present invention, compiler controlsare provided for program regions, such as an instruction sequence. Inone embodiment, the control is associated with a section of the sourcecode, and it may be delimited by indicators, providing a starting andend point.

For instance, a source level programming language specification mayspecify a range of code to use the round to nearest rounding mode, asfollows:

#pragma BEGIN FP_CONTROL: NEAREST Math(float a,b,c) { return a*b+c; }#pragma END FP_CONTROL

In accordance with an aspect of the present invention, a compiler maygenerate the following code based on the above input:

Math: ROUND_NEAREST FM FRT, FRA, FRB ROUND_NEAREST FA FRES, FRT, FRC ...

In the above, the #pragma BEGIN and the #pragma END instructionsdelineate the section of code which is to use a particular floatingpoint control, such as Round-to-Nearest, indicated by Nearest in the#pragma Begin instruction.

In another embodiment, the control may be associated with a higher levellanguage construct, such as a function, method, loop, block, and soforth. One example of this is depicted below where the SET FP_CONTROLcommand is used to specify round to nearest rounding mode for the nextfunction (the function called Math):

#pragma SET FP_CONTROL: NEAREST Math(float a, b, c) { return a*b+c; }

In accordance with an aspect of the present invention, based on theabove input, a compiler may generate:

Math: ROUND_NEAREST FM FRT, FRA, FRB ROUND_NEAREST FA FRES, FRT, FRC ...

Further details relating to using such a control are described withreference to FIG. 14. In one example, it is the compiler performing thislogic. Initially, an input program portion is read, STEP 1400. Adetermination is made as to whether that input corresponds to a floatingpoint mode specification, INQUIRY 1402. That is, are there #pragmaBEGIN/END instructions or a #pragma SET instruction for the sequence ofcode that has been input? If there is, then the active floating pointmode is updated, STEP 1404. For instance, the rounding mode that is usedis that specified on the #pragma instruction, instead of the controlspecified in the floating point control register. An example of updatingthe active floating point mode is described below. Thereafter, adetermination is made as to whether there is more input to be processed,INQUIRY 1406. If so, processing continues with STEP 1400. Otherwise,processing is complete.

Returning to INQUIRY 1402, if the input does not correspond to afloating point mode specification, then the input program is parsed inaccordance with a programming language specification, as in conventionalprocessing, STEP 1410, and the compiler internal representation,including an indication of the active floating point mode for eachinternal representation element when an FP mode has been previouslyspecified in accordance with STEP 1404, is created, STEP 1412.Processing then continues to INQUIRY 1406.

One example of updating the active floating point mode is described withreference to FIG. 15. Initially, a determination is made as to whether apragma BEGIN floating point control is included in the code beingexamined, INQUIRY 1500. If so, then the current floating point mode(e.g., the value stored for the active FP mode, which is either anindication to use a specified mode, or to use a mode specified by thefloating point control register) is pushed onto a FP mode processingstack (a stack maintained during the input reading process to tracknested floating point control specifications), STEP 1502, and the activefloating point mode (FP_mode) is set to the user-specified mode in thepragma instruction, STEP 1504. Returning to INQUIRY 1500, if a pragmaBEGIN floating point control is not in the code being examined, then adetermination is made as to whether a pragma END floating point controlis included in the code being examined, INQUIRY 1510. If a pragma ENDinstruction is included, then the floating point mode that was pushedonto the FP mode processing stack is popped from the stack, STEP 1512.Otherwise, retuning to INQUIRY 1510, if there is no pragma END control,then a further determination is made as to whether there is a pragma SETfloating point control, INQUIRY 1520. If there is a pragma SET floatingpoint control, then the floating point mode is set to the user-specifiedmode, STEP 1522. Otherwise, processing is complete. In a furtherembodiment, other types of inquiries may be made.

A further technique of using the user-specified controls in conjunctionwith one or more compiler optimization techniques is described withreference to FIG. 16. This logic is performed by, e.g., the compiler. Inthis example, internal representation (IR) elements of the code beingexamined are obtained, STEP 1600, and a determination is made as towhether optimization is possible, INQUIRY 1602. That is, does thecompiler recognize an opportunity to optimize the code being examined?If not, then processing continues to determine if there are moreelements to be processed, INQUIRY 1604. If so, processing continues withSTEP 1600. Otherwise, processing is complete.

Returning to INQUIRY 1602, if optimization is possible, then adetermination is made as to whether the user specified a floating pointcontrol mode (e.g., via a pragma delimiter), INQUIRY 1610. If not, thenoptimization is performed in accordance with conventional techniques,STEP 1612. For instance, a default rounding mode is used for constantfolding (i.e., a process of recognizing and evaluating constantexpressions at compile time, rather than computing them at runtime); andin another embodiment, no constant folding is performed as the roundingmode is determined at runtime. Other optimizations are also possible.

Returning to INQUIRY 1610, if the user specified a floating pointcontrol mode, then optimization is performed in accordance with theuser-specified floating point control mode, STEP 1614. For example, theuser-specified rounding mode is used for the constant folding. Otheroptimizations are also possible. Thereafter, processing continues toINQUIRY 1604.

A variety of optimization techniques may be performed in conjunctionwith the techniques of FIG. 16. One example of an optimization beingperformed is constant folding. Constant folding refers to anoptimization that combines constants known at compile time. Inaccordance with an aspect of the present invention, for decimalarithmetic (and rounding at the full digit value for the purpose of thisexample), when constant folding is performed on the expression “1+1.3”,when the active FP rounding mode with an aspect of the present inventionis round to nearest, or round down, or round towards zero, the exampleexpression will be replaced by the constant “2”. When the active FProunding mode is “up” or “away from zero”, the example expression willbe replaced by the value “3”. In one embodiment, when no active FP modeis specified, a compiler may choose round to nearest, in accordance withconvention. In another embodiment, a compiler may not perform constantfolding, in accordance with convention, so as to perform the operationat runtime with the runtime-specified rounding value.

In yet a further aspect of the present invention, the compiler performsa code generation step and converts the internal representations intoassembler code, as described with reference to FIG. 17. Assembler codemay correspond to either assembler source code, object code, or anotherrepresentation. In this example, the compiler internal representation isread, STEP 1700, and a determination is made as to whether the inputcorresponds to an internal representation that includes aprogrammer-specified floating point control mode specification, INQUIRY1702. If so, then machine instructions are generated with a floatingpoint prefix (described above) in accordance with theprogrammer-specified floating point control value, STEP 1704. Otherwise,if the input does not correspond to an internal representation thatincludes a programmer-specified floating point control modespecification, then machine instructions are generated in accordancewith conventional techniques, STEP 1706. Subsequent to generatingmachine instructions, a determination is made as to whether there ismore input to be processed, INQUIRY 1710. If there is more input to beprocessed, then processing continues with STEP 1700. Otherwise,processing is complete, and the generated instructions may be executed.

In one embodiment, the different compiler techniques may be nested. Inyet a further embodiment, there is provided at least one compilertechnique directed at reading source code, parsing the code, andtranslating the parsed code into an abstract syntax tree (AST) or aregister level set of instructions (RTXs), both commonly reflective ofdifferent types of internal representations or internal language of acompiler.

In a further embodiment, the internal representations may be used andconstant folding and other optimizations may be adapted in view of theexpressed rounding mode (or other control) intent. Further, in anotherembodiment, there is provided a code generation technique generatingcode with prefixes, in accordance with an aspect of the invention.

In yet a further aspect, an instruction that associates a control, suchas rounding mode, is indicated to a source language element in a highlevel language, and code parsing, code transformation, optimization andgeneration techniques therefor are provided.

In accordance with a further aspect of the present invention, there areprovided compiler controls for program blocks. In one embodiment, thecontrol is associated with an expression, a block, a loop, a line orother element of the source code, and may be delineated by delimitersproviding a starting and end point. In another embodiment, the programblock may correspond to a function or a subroutine.

One example of a compiler control for code generation with predictablefloating point state for a source line is as follows:

Math(float a,b,c) { #pragma FP_CONTROL: NEAREST float tmp = a*b; #pragmaFP_CONTROL: UP return tmp+c; }

Based on the example input specification above, a compiler may generatethe following assembler code:

Math: ROUND_NEAREST FM FRT, FRA, FRB ROUND_UP, RECORD_ILLEGAL,RECORD_INFINITY FA FRES, FRT, FRC ...

In another embodiment, the control may be associated with a high levellanguage construct, such as an expression, loop, block, and so forth, asindicated in the following example:

 Math(float a,b,c) { #pragma EXPRESSION FP_CONTROL: NEAREST returna*b+c; }

Based on the example input specification above, a compiler may generatethe following assembler code:

Math: ROUND_NEAREST FM FRT, FRA, FRB ROUND_NEAREST FA FRES, FRT, FRC ...

In yet another embodiment, the control may be associated with a highlevel language construct, such as a function, method, loop, block and soforth, as indicated in the following example, e.g.:

#pragma FUNCTION FP_CONTROL: NEAREST -or- #pragma FP_CONTROL: NEARESTMath(float a,b,c) { return a*b+c; }

Based on the example input specification above, a compiler may generatethe following assembler code:

Math: ROUND_NEAREST FM FRT, FRA, FRB ROUND_NEAREST FA FRES, FRT, FRC ...

In the particular example of #pragma FP_control, the compiler infers thenext program structure to apply the floating point control to; in theabove example, the next block is a function.

In another aspect of a block specification, the scope (FUNCTION) isexplicitly specified using #pragma FUNCTION FP_CONTROL.

In a further example, the compiler infers the next program structure toapply the floating point control to (see #pragma FP_control); in thebelow example, the next block is a loop:

float test(float a[ ]) { float sum = 0.0; #pragma LOOP FP_CONTROL:NEAREST -or- #pragma FP_CONTROL: NEAREST for (int i=0; i<MAX;i++) sum+]a[i]; return sum; }

In the particular example of #pragma FP_control, the compiler infers thenext program structure to apply the floating point control to; in theabove example, the next block is a loop.

In another aspect of a block specification, the scope (LOOP) isexplicitly specified using #pragma LOOP FP_CONTROL.

In yet another embodiment, the compiler infers the next programstructure to apply the floating point control to (see, e.g., #pragmaFP_control); in the below example, the next block is a block, i.e., agroup of statements grouped by parenthesis:

float test(float a[ ]) { float sum = 0.0; #pragma BLOCK FP_CONTROL:NEAREST -or- #pragma FP_CONTROL: NEAREST {  sum = a[0];  sum += a[1]; sum += a[2]; } return sum; }

In the particular example of #pragma FP_control, the compiler infers thenext program structure to apply the floating point control to; in theabove example, the next block is a block.

In another aspect of a block specification, the scope (BLOCK) isexplicitly specified using #pragma BLOCK FP_CONTROL.

Further details of one aspect of a compiler technique to performprocessing is described with reference to FIG. 18. Initially, thecompiler starts parsing an input block of a structured language, STEP1800. An AST (Abstract Syntax Tree) header is started for the block(connecting to surrounding ASTs), STEP 1802. A determination is made asto whether the input includes a user-specified floating point modeindicator (e.g., a #pragma instruction), INQUIRY 1804. If so, then thefloating point mode control indicator is added to the AST header, STEP1806. Thereafter, or if the input does not include a floating point modecontrol indicator, then the input is parsed and an AST is generated (asin conventional processing), STEP 1808. Thereafter, a determination ismade as to whether there is more input to be processed, INQUIRY 1810. Ifthere is more input to be processed, then processing continues with STEP1800. Otherwise, processing is complete.

A further aspect of the present invention relates to converting ASTsincluding FP mode specification to IRs with FP mode specification and isdescribed with reference to FIG. 19. In this embodiment, an AST block isobtained, STEP 1900, and a determination is made as to whether the ASTblock includes a floating point mode control indicator (e.g., based on a#pragma instruction), INQUIRY 1902. If it does not include a floatingpoint mode control indicator, then the AST block is translated to aninternal representation in accordance with conventional techniques, STEP1904. However, if the AST block includes a floating point mode controlindicator, then the AST block is translated to an internalrepresentation that includes the floating point mode indicator, STEP1906. In one example, an AST block is translated to an IR using acompiler that performs such translation, such as the Low Level VirtualMachine (LLVM) compiler or another such compiler. The compiler performscode generation that recursively walks an AST and emits an IR into amodule. After translating the AST block to internal representation ineither STEP 1904 or 1906, a determination is made as to whether there ismore input to be processed, INQUIRY 1908. If there is more input to beprocessed, then processing continues with STEP 1900. Otherwise,processing is complete.

In at least one embodiment, one or more of these aspects may be nested.

As described herein, there may be at least one compiler techniquedirected at reading source code, parsing code, translating parsed codeto an abstract syntax tree (AST) or a register level set of expressions(RTXs), both commonly reflective of different types of IR or IL(internal representation or internal language) of a compiler.

The annotation of the pragma or such in the IR indicates static roundingmodes. Further, there is provided a capability for using the IR andadapting constant folding and other optimizations in view of theexpressed rounding mode intent.

Furthermore, there is provided a code generation technique to generatecode with prefixes, in accordance with one or more aspects.

Described herein are various aspects and embodiments of floating pointcontrol processing. Although a number of examples and techniques areprovided, variations and/or additions may be made without departing froma spirit of aspects of the present invention. One or more aspects may becombined with one or more other aspects.

One or more aspects of the present invention are inextricably tied tocomputer technology and facilitate processing within a computer,improving performance thereof. Further details of one embodiment offacilitating processing within a computing environment, as it relates toone or more aspects of the present invention, are described withreference to FIGS. 20A-20B.

Referring to FIG. 20A, in one embodiment, a determination is made that aprogram region has a floating point control associated therewith (2000).The floating point control is indicated by at least one delimiterassociated with the program region (2002). The floating point controlindicated by the at least one delimiter is used to update an activefloating point mode (2004). Code is generated for at least oneinstruction in the program region based on the active floating pointmode (2006).

In one example, the at least one delimiter includes a starting delimiter(2008). In a further example, the at least one delimiter furtherincludes an ending delimiter (2010). In another example, the at leastone delimiter includes a set delimiter (2012).

As an example, the program region includes a set of instructions (2014).In a further example, the program region includes a region selected froma group consisting of: a function, a method, a loop, an instruction, anda block of instructions (2016).

In one embodiment, referring to FIG. 20B, the determining that theprogram region has a floating point control associated therewithincludes detecting the at least one delimiter in the program region(2020).

In a further embodiment, the using the floating point control to updatethe active floating point mode includes: determining whether the atleast one delimiter includes a begin floating point control delimiter(2022); saving, based on determining the at least one delimitercomprises the begin floating point control delimiter, a current value ofthe floating point control (2024); and setting the active floating pointmode to a value of the floating point control indicated by the at leastone delimiter (2026).

In a further aspect, a determination is made as to whether the at leastone delimiter includes an end floating point control delimiter (2028).Based on determining the at least one delimiter includes the endfloating point control delimiter, the active floating mode is restoredto the current value of the floating point control that was saved(2030).

In one example, the using the floating point control to update theactive floating point mode includes determining whether the at least onedelimiter comprises a set delimiter (2032). Based on determining the atleast one delimiter includes the set delimiter, the active floatingpoint mode is set to a value of the floating point control indicated bythe at least one delimiter (2034).

In accordance with one or more aspects of the present invention,efficiencies and/or optimizations are provided for managing floatingpoint controls. These efficiencies/optimizations facilitate processingwithin a computing environment, thereby enhancing performance and/orreducing costs.

Many variations are possible without departing from a spirit of aspectsof the present invention. It should be noted that numerous aspects andfeatures are described herein, and unless otherwise inconsistent, eachaspect or feature may be combinable with any other aspect or feature.

Other types of computing environments may also incorporate and use oneor more aspects of the present invention, including, but not limited to,emulation environments, an example of which is described with referenceto FIG. 21A. In this example, a computing environment 2100 includes, forinstance, a native central processing unit (CPU) 2102, a memory 2104,and one or more input/output devices and/or interfaces 2106 coupled toone another via, for example, one or more buses 2108 and/or otherconnections. As examples, computing environment 2100 may include aPowerPC processor or a pSeries server offered by International BusinessMachines Corporation, Armonk, New York; and/or other machines based onarchitectures offered by International Business Machines Corporation,Intel, or other companies.

Native central processing unit 2102 includes one or more nativeregisters 2110, such as one or more general purpose registers and/or oneor more special purpose registers used during processing within theenvironment. These registers include information that represents thestate of the environment at any particular point in time.

Moreover, native central processing unit 2102 executes instructions andcode that are stored in memory 2104. In one particular example, thecentral processing unit executes emulator code 2112 stored in memory2104. This code enables the computing environment configured in onearchitecture to emulate another architecture. For instance, emulatorcode 2112 allows machines based on architectures other than thez/Architecture, such as PowerPC processors, pSeries servers, or otherservers or processors, to emulate the z/Architecture and to executesoftware and instructions developed based on the z/Architecture.

Further details relating to emulator code 2112 are described withreference to FIG. 21B. Guest instructions 2150 stored in memory 2104comprise software instructions (e.g., correlating to machineinstructions) that were developed to be executed in an architectureother than that of native CPU 2102. For example, guest instructions 2150may have been designed to execute on a z/Architecture processor, butinstead, are being emulated on native CPU 2102, which may be, forexample, an Intel processor. In one example, emulator code 2112 includesan instruction fetching routine 2152 to obtain one or more guestinstructions 2150 from memory 2104, and to optionally provide localbuffering for the instructions obtained. It also includes an instructiontranslation routine 2154 to determine the type of guest instruction thathas been obtained and to translate the guest instruction into one ormore corresponding native instructions 2156. This translation includes,for instance, identifying the function to be performed by the guestinstruction and choosing the native instruction(s) to perform thatfunction.

Further, emulator code 2112 includes an emulation control routine 2160to cause the native instructions to be executed. Emulation controlroutine 2160 may cause native CPU 2102 to execute a routine of nativeinstructions that emulate one or more previously obtained guestinstructions and, at the conclusion of such execution, return control tothe instruction fetch routine to emulate the obtaining of the next guestinstruction or a group of guest instructions. Execution of nativeinstructions 2156 may include loading data into a register from memory2104; storing data back to memory from a register; or performing sometype of arithmetic or logic operation, as determined by the translationroutine.

Each routine is, for instance, implemented in software, which is storedin memory and executed by native central processing unit 2102. In otherexamples, one or more of the routines or operations are implemented infirmware, hardware, software or some combination thereof. The registersof the emulated processor may be emulated using registers 2110 of thenative CPU or by using locations in memory 2104. In embodiments, guestinstructions 2150, native instructions 2156 and emulator code 2112 mayreside in the same memory or may be disbursed among different memorydevices.

As used herein, firmware includes, e.g., the microcode or Millicode ofthe processor. It includes, for instance, the hardware-levelinstructions and/or data structures used in implementation of higherlevel machine code. In one embodiment, it includes, for instance,proprietary code that is typically delivered as microcode that includestrusted software or microcode specific to the underlying hardware andcontrols operating system access to the system hardware.

A guest instruction 2150 that is obtained, translated and executed maybe, for instance, one of the instructions described herein. Theinstruction, which is of one architecture (e.g., the z/Architecture), isfetched from memory, translated and represented as a sequence of nativeinstructions 2156 of another architecture (e.g., PowerPC, pSeries,Intel, etc.). These native instructions are then executed.

One or more aspects may relate to cloud computing.

It is understood in advance that although this disclosure includes adetailed description on cloud computing, implementation of the teachingsrecited herein are not limited to a cloud computing environment. Rather,embodiments of the present invention are capable of being implemented inconjunction with any other type of computing environment now known orlater developed.

Cloud computing is a model of service delivery for enabling convenient,on-demand network access to a shared pool of configurable computingresources (e.g. networks, network bandwidth, servers, processing,memory, storage, applications, virtual machines, and services) that canbe rapidly provisioned and released with minimal management effort orinteraction with a provider of the service. This cloud model may includeat least five characteristics, at least three service models, and atleast four deployment models.

Characteristics are as Follows:

On-demand self-service: a cloud consumer can unilaterally provisioncomputing capabilities, such as server time and network storage, asneeded automatically without requiring human interaction with theservice's provider.

Broad network access: capabilities are available over a network andaccessed through standard mechanisms that promote use by heterogeneousthin or thick client platforms (e.g., mobile phones, laptops, and PDAs).

Resource pooling: the provider's computing resources are pooled to servemultiple consumers using a multi-tenant model, with different physicaland virtual resources dynamically assigned and reassigned according todemand. There is a sense of location independence in that the consumergenerally has no control or knowledge over the exact location of theprovided resources but may be able to specify location at a higher levelof abstraction (e.g., country, state, or datacenter).

Rapid elasticity: capabilities can be rapidly and elasticallyprovisioned, in some cases automatically, to quickly scale out andrapidly released to quickly scale in. To the consumer, the capabilitiesavailable for provisioning often appear to be unlimited and can bepurchased in any quantity at any time.

Measured service: cloud systems automatically control and optimizeresource use by leveraging a metering capability at some level ofabstraction appropriate to the type of service (e.g., storage,processing, bandwidth, and active user accounts). Resource usage can bemonitored, controlled, and reported providing transparency for both theprovider and consumer of the utilized service.

Service Models are as Follows:

Software as a Service (SaaS): the capability provided to the consumer isto use the provider's applications running on a cloud infrastructure.The applications are accessible from various client devices through athin client interface such as a web browser (e.g., web-based email). Theconsumer does not manage or control the underlying cloud infrastructureincluding network, servers, operating systems, storage, or evenindividual application capabilities, with the possible exception oflimited user-specific application configuration settings.

Platform as a Service (PaaS): the capability provided to the consumer isto deploy onto the cloud infrastructure consumer-created or acquiredapplications created using programming languages and tools supported bythe provider. The consumer does not manage or control the underlyingcloud infrastructure including networks, servers, operating systems, orstorage, but has control over the deployed applications and possiblyapplication hosting environment configurations.

Infrastructure as a Service (IaaS): the capability provided to theconsumer is to provision processing, storage, networks, and otherfundamental computing resources where the consumer is able to deploy andrun arbitrary software, which can include operating systems andapplications. The consumer does not manage or control the underlyingcloud infrastructure but has control over operating systems, storage,deployed applications, and possibly limited control of select networkingcomponents (e.g., host firewalls).

Deployment Models are as Follows:

Private cloud: the cloud infrastructure is operated solely for anorganization. It may be managed by the organization or a third party andmay exist on-premises or off-premises.

Community cloud: the cloud infrastructure is shared by severalorganizations and supports a specific community that has shared concerns(e.g., mission, security requirements, policy, and complianceconsiderations). It may be managed by the organizations or a third partyand may exist on-premises or off-premises.

Public cloud: the cloud infrastructure is made available to the generalpublic or a large industry group and is owned by an organization sellingcloud services.

Hybrid cloud: the cloud infrastructure is a composition of two or moreclouds (private, community, or public) that remain unique entities butare bound together by standardized or proprietary technology thatenables data and application portability (e.g., cloud bursting forloadbalancing between clouds).

A cloud computing environment is service oriented with a focus onstatelessness, low coupling, modularity, and semantic interoperability.At the heart of cloud computing is an infrastructure comprising anetwork of interconnected nodes.

Referring now to FIG. 22, illustrative cloud computing environment 50 isdepicted. As shown, cloud computing environment 50 comprises one or morecloud computing nodes 10 with which local computing devices used bycloud consumers, such as, for example, personal digital assistant (PDA)or cellular telephone 54A, desktop computer 54B, laptop computer 54C,and/or automobile computer system 54N may communicate. Nodes 10 maycommunicate with one another. They may be grouped (not shown) physicallyor virtually, in one or more networks, such as Private, Community,Public, or Hybrid clouds as described hereinabove, or a combinationthereof. This allows cloud computing environment 50 to offerinfrastructure, platforms and/or software as services for which a cloudconsumer does not need to maintain resources on a local computingdevice. It is understood that the types of computing devices 54A-N shownin FIG. 22 are intended to be illustrative only and that computing nodes10 and cloud computing environment 50 can communicate with any type ofcomputerized device over any type of network and/or network addressableconnection (e.g., using a web browser).

Referring now to FIG. 23, a set of functional abstraction layersprovided by cloud computing environment 50 (FIG. 22) is shown. It shouldbe understood in advance that the components, layers, and functionsshown in FIG. 23 are intended to be illustrative only and embodiments ofthe invention are not limited thereto. As depicted, the following layersand corresponding functions are provided:

Hardware and software layer 60 includes hardware and softwarecomponents. Examples of hardware components include mainframes 61; RISC(Reduced Instruction Set Computer) architecture based servers 62;servers 63; blade servers 64; storage devices 65; and networks andnetworking components 66. In some embodiments, software componentsinclude network application server software 67 and database software 68.

Virtualization layer 70 provides an abstraction layer from which thefollowing examples of virtual entities may be provided: virtual servers71; virtual storage 72; virtual networks 73, including virtual privatenetworks; virtual applications and operating systems 74; and virtualclients 75.

In one example, management layer 80 may provide the functions describedbelow. Resource provisioning 81 provides dynamic procurement ofcomputing resources and other resources that are utilized to performtasks within the cloud computing environment. Metering and Pricing 82provide cost tracking as resources are utilized within the cloudcomputing environment, and billing or invoicing for consumption of theseresources. In one example, these resources may comprise applicationsoftware licenses. Security provides identity verification for cloudconsumers and tasks, as well as protection for data and other resources.User portal 83 provides access to the cloud computing environment forconsumers and system administrators. Service level management 84provides cloud computing resource allocation and management such thatrequired service levels are met. Service Level Agreement (SLA) planningand fulfillment 85 provide pre-arrangement for, and procurement of,cloud computing resources for which a future requirement is anticipatedin accordance with an SLA.

Workloads layer 90 provides examples of functionality for which thecloud computing environment may be utilized. Examples of workloads andfunctions which may be provided from this layer include: mapping andnavigation 91; software development and lifecycle management 92; virtualclassroom education delivery 93; data analytics processing 94;transaction processing 95; and floating point (FP) control processing96.

One or more aspects of the present invention are inextricably tied tocomputer technology and facilitate processing within a computer,improving performance thereof.

The present invention may be a system, a method, and/or a computerprogram product at any possible technical detail level of integration.The computer program product may include a computer readable storagemedium (or media) having computer readable program instructions thereonfor causing a processor to carry out aspects of the present invention.

The computer readable storage medium can be a tangible device that canretain and store instructions for use by an instruction executiondevice. The computer readable storage medium may be, for example, but isnot limited to, an electronic storage device, a magnetic storage device,an optical storage device, an electromagnetic storage device, asemiconductor storage device, or any suitable combination of theforegoing. A non-exhaustive list of more specific examples of thecomputer readable storage medium includes the following: a portablecomputer diskette, a hard disk, a random access memory (RAM), aread-only memory (ROM), an erasable programmable read-only memory (EPROMor Flash memory), a static random access memory (SRAM), a portablecompact disc read-only memory (CD-ROM), a digital versatile disk (DVD),a memory stick, a floppy disk, a mechanically encoded device such aspunch-cards or raised structures in a groove having instructionsrecorded thereon, and any suitable combination of the foregoing. Acomputer readable storage medium, as used herein, is not to be construedas being transitory signals per se, such as radio waves or other freelypropagating electromagnetic waves, electromagnetic waves propagatingthrough a waveguide or other transmission media (e.g., light pulsespassing through a fiber-optic cable), or electrical signals transmittedthrough a wire.

Computer readable program instructions described herein can bedownloaded to respective computing/processing devices from a computerreadable storage medium or to an external computer or external storagedevice via a network, for example, the Internet, a local area network, awide area network and/or a wireless network. The network may comprisecopper transmission cables, optical transmission fibers, wirelesstransmission, routers, firewalls, switches, gateway computers and/oredge servers. A network adapter card or network interface in eachcomputing/processing device receives computer readable programinstructions from the network and forwards the computer readable programinstructions for storage in a computer readable storage medium withinthe respective computing/processing device.

Computer readable program instructions for carrying out operations ofthe present invention may be assembler instructions,instruction-set-architecture (ISA) instructions, machine instructions,machine dependent instructions, microcode, firmware instructions,state-setting data, configuration data for integrated circuitry, oreither source code or object code written in any combination of one ormore programming languages, including an object oriented programminglanguage such as Smalltalk, C++, or the like, and procedural programminglanguages, such as the “C” programming language or similar programminglanguages. The computer readable program instructions may executeentirely on the user's computer, partly on the user's computer, as astand-alone software package, partly on the user's computer and partlyon a remote computer or entirely on the remote computer or server. Inthe latter scenario, the remote computer may be connected to the user'scomputer through any type of network, including a local area network(LAN) or a wide area network (WAN), or the connection may be made to anexternal computer (for example, through the Internet using an InternetService Provider). In some embodiments, electronic circuitry including,for example, programmable logic circuitry, field-programmable gatearrays (FPGA), or programmable logic arrays (PLA) may execute thecomputer readable program instructions by utilizing state information ofthe computer readable program instructions to personalize the electroniccircuitry, in order to perform aspects of the present invention.

Aspects of the present invention are described herein with reference toflowchart illustrations and/or block diagrams of methods, apparatus(systems), and computer program products according to embodiments of theinvention. It will be understood that each block of the flowchartillustrations and/or block diagrams, and combinations of blocks in theflowchart illustrations and/or block diagrams, can be implemented bycomputer readable program instructions.

These computer readable program instructions may be provided to aprocessor of a general purpose computer, special purpose computer, orother programmable data processing apparatus to produce a machine, suchthat the instructions, which execute via the processor of the computeror other programmable data processing apparatus, create means forimplementing the functions/acts specified in the flowchart and/or blockdiagram block or blocks. These computer readable program instructionsmay also be stored in a computer readable storage medium that can directa computer, a programmable data processing apparatus, and/or otherdevices to function in a particular manner, such that the computerreadable storage medium having instructions stored therein comprises anarticle of manufacture including instructions which implement aspects ofthe function/act specified in the flowchart and/or block diagram blockor blocks.

The computer readable program instructions may also be loaded onto acomputer, other programmable data processing apparatus, or other deviceto cause a series of operational steps to be performed on the computer,other programmable apparatus or other device to produce a computerimplemented process, such that the instructions which execute on thecomputer, other programmable apparatus, or other device implement thefunctions/acts specified in the flowchart and/or block diagram block orblocks.

The flowchart and block diagrams in the Figures illustrate thearchitecture, functionality, and operation of possible implementationsof systems, methods, and computer program products according to variousembodiments of the present invention. In this regard, each block in theflowchart or block diagrams may represent a module, segment, or portionof instructions, which comprises one or more executable instructions forimplementing the specified logical function(s). In some alternativeimplementations, the functions noted in the block may occur out of theorder noted in the figures. For example, two blocks shown in successionmay, in fact, be executed substantially concurrently, or the blocks maysometimes be executed in the reverse order, depending upon thefunctionality involved. It will also be noted that each block of theblock diagrams and/or flowchart illustration, and combinations of blocksin the block diagrams and/or flowchart illustration, can be implementedby special purpose hardware-based systems that perform the specifiedfunctions or acts or carry out combinations of special purpose hardwareand computer instructions.

In addition to the above, one or more aspects may be provided, offered,deployed, managed, serviced, etc. by a service provider who offersmanagement of customer environments. For instance, the service providercan create, maintain, support, etc. computer code and/or a computerinfrastructure that performs one or more aspects for one or morecustomers. In return, the service provider may receive payment from thecustomer under a subscription and/or fee agreement, as examples.Additionally or alternatively, the service provider may receive paymentfrom the sale of advertising content to one or more third parties.

In one aspect, an application may be deployed for performing one or moreembodiments. As one example, the deploying of an application comprisesproviding computer infrastructure operable to perform one or moreembodiments.

As a further aspect, a computing infrastructure may be deployedcomprising integrating computer readable code into a computing system,in which the code in combination with the computing system is capable ofperforming one or more embodiments.

As yet a further aspect, a process for integrating computinginfrastructure comprising integrating computer readable code into acomputer system may be provided. The computer system comprises acomputer readable medium, in which the computer medium comprises one ormore embodiments. The code in combination with the computer system iscapable of performing one or more embodiments.

Although various embodiments are described above, these are onlyexamples. For example, computing environments of other architectures canbe used to incorporate and use one or more embodiments. Further,different instructions, instruction formats, instruction fields and/orinstruction values may be used. Many variations are possible.

Further, other types of computing environments can benefit and be used.As an example, a data processing system suitable for storing and/orexecuting program code is usable that includes at least two processorscoupled directly or indirectly to memory elements through a system bus.The memory elements include, for instance, local memory employed duringactual execution of the program code, bulk storage, and cache memorywhich provide temporary storage of at least some program code in orderto reduce the number of times code must be retrieved from bulk storageduring execution.

Input/Output or I/O devices (including, but not limited to, keyboards,displays, pointing devices, DASD, tape, CDs, DVDs, thumb drives andother memory media, etc.) can be coupled to the system either directlyor through intervening I/O controllers. Network adapters may also becoupled to the system to enable the data processing system to becomecoupled to other data processing systems or remote printers or storagedevices through intervening private or public networks. Modems, cablemodems, and Ethernet cards are just a few of the available types ofnetwork adapters.

The terminology used herein is for the purpose of describing particularembodiments only and is not intended to be limiting. As used herein, thesingular forms “a”, “an” and “the” are intended to include the pluralforms as well, unless the context clearly indicates otherwise. It willbe further understood that the terms “comprises” and/or “comprising”,when used in this specification, specify the presence of statedfeatures, integers, steps, operations, elements, and/or components, butdo not preclude the presence or addition of one or more other features,integers, steps, operations, elements, components and/or groups thereof.

The corresponding structures, materials, acts, and equivalents of allmeans or step plus function elements in the claims below, if any, areintended to include any structure, material, or act for performing thefunction in combination with other claimed elements as specificallyclaimed. The description of one or more embodiments has been presentedfor purposes of illustration and description, but is not intended to beexhaustive or limited to in the form disclosed. Many modifications andvariations will be apparent to those of ordinary skill in the art. Theembodiment was chosen and described in order to best explain variousaspects and the practical application, and to enable others of ordinaryskill in the art to understand various embodiments with variousmodifications as are suited to the particular use contemplated.

What is claimed is:
 1. A computer-implemented method of facilitatingprocessing within a computing environment, the computer-implementedmethod of comprising: determining that a program region has a floatingpoint control associated therewith, the floating point control indicatedby at least one delimiter associated with the program region; using thefloating point control indicated by the at least one delimiter to updatean active floating point mode; and generating code for at least oneinstruction in the program region based on the active floating pointmode.
 2. The computer-implemented method of claim 1, wherein the atleast one delimiter comprises a starting delimiter.
 3. Thecomputer-implemented method of claim 2, wherein the at least onedelimiter further comprises an ending delimiter.
 4. Thecomputer-implemented method of claim 1, wherein the at least onedelimiter comprises a set delimiter.
 5. The computer-implemented methodof claim 1, wherein the program region comprises a set of instructions.6. The computer-implemented method of claim 1, wherein the programregion comprises a region selected from a group consisting of: afunction, a method, a loop, an instruction, and a block of instructions.7. The computer-implemented method of claim 1, wherein the determiningthat the program region has a floating point control associatedtherewith comprises detecting the at least one delimiter in the programregion.
 8. The computer-implemented method of claim 1, wherein the usingthe floating point control to update the active floating point modecomprises: determining whether the at least one delimiter comprises abegin floating point control delimiter; saving, based on determining theat least one delimiter comprises the begin floating point controldelimiter, a current value of the floating point control; and settingthe active floating point mode to a value of the floating point controlindicated by the at least one delimiter.
 9. The computer-implementedmethod of claim 8, further comprising: determining whether the at leastone delimiter comprises an end floating point control delimiter; andrestoring the active floating mode to the current value of the floatingpoint control that was saved, based on determining the at least onedelimiter comprises the end floating point control delimiter.
 10. Thecomputer-implemented method of claim 1, wherein the using the floatingpoint control to update the active floating point mode comprises:determining whether the at least one delimiter comprises a setdelimiter; and setting the active floating point mode to a value of thefloating point control indicated by the at least one delimiter, based ondetermining the at least one delimiter comprises the set delimiter.